Cardinal Arithmetic in Weak Theories

نویسنده

  • Albert Visser
چکیده

In this paper we develop the theory of cardinals in the theory COPY. This is the theory of two total, jointly injective binary predicates in a second order version, where we may quantify over binary relations. The only second order axioms of the theory are the axiom asserting the existence of an empty relation and the adjunction axiom, which says that we may enrich any relation R with a pair x, y. The theory COPY is strictly weaker than the theory AS, adjunctive set theory. The relevant notion of weaker here is direct interpretability. We will explain and motivate this notion in the paper. A consequence is that our development of cardinals is inherited by stronger theories like AS. We will show that the cardinals satisfy (at least) Robinson’s Arithmetic Q. A curious aspect of our approach is that we develop cardinal multiplication using neither recursion nor pairing, thus diverging both from Frege’s paradigm and from the tradition in set theory. Our development directly uses the universal property characterizing the product that is familiar from category theory. The broader context of this paper is the study of a double degree structure: the degrees of (relative) interpretability and the finer degrees of direct interpretability. Most of the theories studied are in one of two degrees of interpretability: the bottom degree of predicate logic or the degree of Q. The theories will differ significantly if we compare them using direct interpretability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 On properties of theories which preclude the existence of universal models

In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a sufficient condition for a theory not to have universal models in cardinality λ when certain cardinal arithmetic assumptions implying the failure of GCH (and clos...

متن کامل

Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice

Fairly deep results of Zermelo-Frænkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is κ⊗ κ = κ, where κ is any infinite cardinal. Proving this result required developing theories of orders, order-isomorphisms, order types, ordinal arithmetic, cardinals, e...

متن کامل

Weak Theories of Nonstandard Arithmetic and Analysis

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched. §

متن کامل

Weak Diamond

Under some cardinal arithmetic assumptions, we prove that every stationary of λ of a right cofinality has the weak diamond. This is a strong negation of uniformization. We then deal with a weaker version of the weak diamond-colouring restrictions. We then deal with semi-saturated (normal) filters.

متن کامل

On some configurations related to the Shelah Weak Hypothesis

We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008